0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.37	% Computer   : n013.cluster.edu
0.15/0.37	% Model      : x86_64 x86_64
0.15/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.37	% Memory     : 8042.1875MB
0.15/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.37	% CPULimit   : 1200
0.15/0.37	% WCLimit    : 120
0.15/0.37	% DateTime   : Tue Jul 13 15:42:18 EDT 2021
0.15/0.37	% CPUTime    : 
0.15/0.37	% Number of cores: 8
0.15/0.38	% Python version: Python 3.6.8
0.15/0.38	# Version: 2.6rc1-ho
0.15/0.39	# No SInE strategy applied
0.15/0.39	# Trying AutoSched0 for 59 seconds
2.25/2.45	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
2.25/2.45	# and selection function SelectComplexExceptUniqMaxHorn.
2.25/2.45	#
2.25/2.45	# Preprocessing time       : 0.074 s
2.25/2.45	# Presaturation interreduction done
2.25/2.45	
2.25/2.45	# Proof found!
2.25/2.45	# SZS status Theorem
2.25/2.45	# SZS output start CNFRefutation
2.25/2.45	thf(fact_136_sup__commute, axiom, (sup_sup_set_a)=(^[X118:set_a, X119:set_a]:sup_sup_set_a @ X119 @ X118), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_136_sup__commute)).
2.25/2.45	thf(fact_39_inj__on__Un__image__eq__iff, axiom, ![X2:a > b, X172:set_a, X173:set_a]:(((image_a_b @ X2 @ X172)=(image_a_b @ X2 @ X173)<=>(X172)=(X173))<=inj_on_a_b @ X2 @ (sup_sup_set_a @ X172 @ X173)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_39_inj__on__Un__image__eq__iff)).
2.25/2.45	thf(fact_8_o__inj__on, axiom, ![X2:a > b, X576:c > a, X577:c > a]:((comp_a_b_c @ X2 @ X576)=(comp_a_b_c @ X2 @ X577)=>((X576)=(X577)<=inj_on_a_b @ X2 @ (sup_sup_set_a @ (image_c_a @ X576 @ top_top_set_c) @ (image_c_a @ X577 @ top_top_set_c)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_o__inj__on)).
2.25/2.45	thf(conj_0, hypothesis, inj_on_a_b @ f @ (sup_sup_set_a @ (image_c_a @ g @ top_top_set_c) @ (image_c_a @ h @ top_top_set_c)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
2.25/2.45	thf(fact_306_image__comp, axiom, ![X2:a > b, X947:c > a, X948:set_c]:(image_a_b @ X2 @ (image_c_a @ X947 @ X948))=(image_c_b @ (comp_a_b_c @ X2 @ X947) @ X948), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_306_image__comp)).
2.25/2.45	thf(conj_1, hypothesis, (comp_a_b_c @ f @ g)=(comp_a_b_c @ f @ h), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)).
2.25/2.45	thf(fact_126_sup_Oidem, axiom, ![X99:set_a]:(sup_sup_set_a @ X99 @ X99)=(X99), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_126_sup_Oidem)).
2.25/2.45	thf(conj_2, conjecture, (g)=(h), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_2)).
2.25/2.45	thf(c_0_8, plain, ![X118:set_a, X119:set_a]:(sup_sup_set_a @ X118 @ X119)=(sup_sup_set_a @ X119 @ X118), inference(fof_simplification,[status(thm)],[fact_136_sup__commute])).
2.25/2.45	thf(c_0_9, plain, ![X2:a > b, X172:set_a, X173:set_a]:(inj_on_a_b @ X2 @ (sup_sup_set_a @ X172 @ X173)=>((image_a_b @ X2 @ X172)=(image_a_b @ X2 @ X173)<=>(X172)=(X173))), inference(fof_simplification,[status(thm)],[fact_39_inj__on__Un__image__eq__iff])).
2.25/2.45	thf(c_0_10, plain, ![X2222:set_a, X2223:set_a]:(sup_sup_set_a @ X2222 @ X2223)=(sup_sup_set_a @ X2223 @ X2222), inference(variable_rename,[status(thm)],[c_0_8])).
2.25/2.45	thf(c_0_11, plain, ![X2:a > b, X576:c > a, X577:c > a]:((comp_a_b_c @ X2 @ X576)=(comp_a_b_c @ X2 @ X577)=>(inj_on_a_b @ X2 @ (sup_sup_set_a @ (image_c_a @ X576 @ top_top_set_c) @ (image_c_a @ X577 @ top_top_set_c))=>(X576)=(X577))), inference(fof_simplification,[status(thm)],[fact_8_o__inj__on])).
2.25/2.45	thf(c_0_12, plain, ![X2308:a > b, X2309:set_a, X2310:set_a]:(((image_a_b @ X2308 @ X2309)!=(image_a_b @ X2308 @ X2310)|(X2309)=(X2310)|~inj_on_a_b @ X2308 @ (sup_sup_set_a @ X2309 @ X2310))&((X2309)!=(X2310)|(image_a_b @ X2308 @ X2309)=(image_a_b @ X2308 @ X2310)|~inj_on_a_b @ X2308 @ (sup_sup_set_a @ X2309 @ X2310))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
2.25/2.45	thf(c_0_13, hypothesis, inj_on_a_b @ f @ (sup_sup_set_a @ (image_c_a @ g @ top_top_set_c) @ (image_c_a @ h @ top_top_set_c)), inference(split_conjunct,[status(thm)],[conj_0])).
2.25/2.45	thf(c_0_14, plain, ![X71:set_a, X54:set_a]:(sup_sup_set_a @ X54 @ X71)=(sup_sup_set_a @ X71 @ X54), inference(split_conjunct,[status(thm)],[c_0_10])).
2.25/2.45	thf(c_0_15, plain, ![X3338:a > b, X3339:c > a, X3340:set_c]:(image_a_b @ X3338 @ (image_c_a @ X3339 @ X3340))=(image_c_b @ (comp_a_b_c @ X3338 @ X3339) @ X3340), inference(variable_rename,[status(thm)],[fact_306_image__comp])).
2.25/2.45	thf(c_0_16, plain, ![X2870:a > b, X2871:c > a, X2872:c > a]:((comp_a_b_c @ X2870 @ X2871)!=(comp_a_b_c @ X2870 @ X2872)|(~inj_on_a_b @ X2870 @ (sup_sup_set_a @ (image_c_a @ X2871 @ top_top_set_c) @ (image_c_a @ X2872 @ top_top_set_c))|(X2871)=(X2872))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])).
2.25/2.46	thf(c_0_17, plain, ![X2:a > b, X54:set_a, X71:set_a]:((X54)=(X71)|(image_a_b @ X2 @ X54)!=(image_a_b @ X2 @ X71)|~inj_on_a_b @ X2 @ (sup_sup_set_a @ X54 @ X71)), inference(split_conjunct,[status(thm)],[c_0_12])).
2.25/2.46	thf(c_0_18, hypothesis, inj_on_a_b @ f @ (sup_sup_set_a @ (image_c_a @ h @ top_top_set_c) @ (image_c_a @ g @ top_top_set_c)), inference(rw,[status(thm)],[c_0_13, c_0_14])).
2.25/2.46	thf(c_0_19, plain, ![X2:a > b, X3:c > a, X24:set_c]:(image_a_b @ X2 @ (image_c_a @ X3 @ X24))=(image_c_b @ (comp_a_b_c @ X2 @ X3) @ X24), inference(split_conjunct,[status(thm)],[c_0_15])).
2.25/2.46	thf(c_0_20, hypothesis, (comp_a_b_c @ f @ g)=(comp_a_b_c @ f @ h), inference(split_conjunct,[status(thm)],[conj_1])).
2.25/2.46	thf(c_0_21, plain, ![X2:a > b, X3:c > a, X9:c > a]:((X3)=(X9)|(comp_a_b_c @ X2 @ X3)!=(comp_a_b_c @ X2 @ X9)|~inj_on_a_b @ X2 @ (sup_sup_set_a @ (image_c_a @ X3 @ top_top_set_c) @ (image_c_a @ X9 @ top_top_set_c))), inference(split_conjunct,[status(thm)],[c_0_16])).
2.25/2.46	thf(c_0_22, hypothesis, (image_c_a @ g @ top_top_set_c)=(image_c_a @ h @ top_top_set_c), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19]), c_0_19]), c_0_20])])).
2.25/2.46	thf(c_0_23, plain, ![X2189:set_a]:(sup_sup_set_a @ X2189 @ X2189)=(X2189), inference(variable_rename,[status(thm)],[fact_126_sup_Oidem])).
2.25/2.46	thf(c_0_24, negated_conjecture, (g)!=(h), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])])).
2.25/2.46	thf(c_0_25, hypothesis, ![X2:a > b, X3:c > a]:((X3)=(g)|(comp_a_b_c @ X2 @ X3)!=(comp_a_b_c @ X2 @ g)|~inj_on_a_b @ X2 @ (sup_sup_set_a @ (image_c_a @ X3 @ top_top_set_c) @ (image_c_a @ h @ top_top_set_c))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
2.25/2.46	thf(c_0_26, plain, ![X54:set_a]:(sup_sup_set_a @ X54 @ X54)=(X54), inference(split_conjunct,[status(thm)],[c_0_23])).
2.25/2.46	thf(c_0_27, negated_conjecture, (g)!=(h), inference(split_conjunct,[status(thm)],[c_0_24])).
2.25/2.46	thf(c_0_28, hypothesis, ![X2:a > b]:((comp_a_b_c @ X2 @ g)!=(comp_a_b_c @ X2 @ h)|~inj_on_a_b @ X2 @ (image_c_a @ h @ top_top_set_c)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])).
2.25/2.46	thf(c_0_29, hypothesis, inj_on_a_b @ f @ (image_c_a @ h @ top_top_set_c), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_22]), c_0_26])).
2.25/2.46	thf(c_0_30, hypothesis, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_20])]), ['proof']).
2.25/2.46	# SZS output end CNFRefutation
2.25/2.46	# Proof object total steps             : 31
2.25/2.46	# Proof object clause steps            : 14
2.25/2.46	# Proof object formula steps           : 17
2.25/2.46	# Proof object conjectures             : 3
2.25/2.46	# Proof object clause conjectures      : 1
2.25/2.46	# Proof object formula conjectures     : 2
2.25/2.46	# Proof object initial clauses used    : 8
2.25/2.46	# Proof object initial formulas used   : 8
2.25/2.46	# Proof object generating inferences   : 4
2.25/2.46	# Proof object simplifying inferences  : 10
2.25/2.46	# Training examples: 0 positive, 0 negative
2.25/2.46	# Parsed axioms                        : 434
2.25/2.46	# Removed by relevancy pruning/SinE    : 0
2.25/2.46	# Initial clauses                      : 677
2.25/2.46	# Removed in clause preprocessing      : 110
2.25/2.46	# Initial clauses in saturation        : 567
2.25/2.46	# Processed clauses                    : 9608
2.25/2.46	# ...of these trivial                  : 142
2.25/2.46	# ...subsumed                          : 5330
2.25/2.46	# ...remaining for further processing  : 4136
2.25/2.46	# Other redundant clauses eliminated   : 35577
2.25/2.46	# Clauses deleted for lack of memory   : 0
2.25/2.46	# Backward-subsumed                    : 34
2.25/2.46	# Backward-rewritten                   : 8
2.25/2.46	# Generated clauses                    : 148400
2.25/2.46	# ...of the previous two non-trivial   : 92194
2.25/2.46	# Contextual simplify-reflections      : 28
2.25/2.46	# Paramodulations                      : 63901
2.25/2.46	# Factorizations                       : 0
2.25/2.46	# NegExts                              : 1377
2.25/2.46	# Equation resolutions                 : 35735
2.25/2.46	# Propositional unsat checks           : 0
2.25/2.46	#    Propositional check models        : 0
2.25/2.46	#    Propositional check unsatisfiable : 0
2.25/2.46	#    Propositional clauses             : 0
2.25/2.46	#    Propositional clauses after purity: 0
2.25/2.46	#    Propositional unsat core size     : 0
2.25/2.46	#    Propositional preprocessing time  : 0.000
2.25/2.46	#    Propositional encoding time       : 0.000
2.25/2.46	#    Propositional solver time         : 0.000
2.25/2.46	#    Success case prop preproc time    : 0.000
2.25/2.46	#    Success case prop encoding time   : 0.000
2.25/2.46	#    Success case prop solver time     : 0.000
2.25/2.46	# Current number of processed clauses  : 3598
2.25/2.46	#    Positive orientable unit clauses  : 109
2.25/2.46	#    Positive unorientable unit clauses: 10
2.25/2.46	#    Negative unit clauses             : 2
2.25/2.46	#    Non-unit-clauses                  : 3477
2.25/2.46	# Current number of unprocessed clauses: 83576
2.25/2.46	# ...number of literals in the above   : 357995
2.25/2.46	# Current number of archived formulas  : 0
2.25/2.46	# Current number of archived clauses   : 502
2.25/2.46	# Clause-clause subsumption calls (NU) : 1164458
2.25/2.46	# Rec. Clause-clause subsumption calls : 693170
2.25/2.46	# Non-unit clause-clause subsumptions  : 5143
2.25/2.46	# Unit Clause-clause subsumption calls : 24531
2.25/2.46	# Rewrite failures with RHS unbound    : 0
2.25/2.46	# BW rewrite match attempts            : 17417
2.25/2.46	# BW rewrite match successes           : 85
2.25/2.46	# Condensation attempts                : 0
2.25/2.46	# Condensation successes               : 0
2.25/2.46	# Termbank termtop insertions          : 2117148
2.25/2.46	
2.25/2.46	# -------------------------------------------------
2.25/2.46	# User time                : 2.033 s
2.25/2.46	# System time              : 0.051 s
2.25/2.46	# Total time               : 2.084 s
2.25/2.46	# Maximum resident set size: 2704 pages
2.25/2.46	EOF